Adjusted Iterated Greedy for the optimization of additive manufacturing scheduling problems
نویسندگان
چکیده
• Extrusion-based production scheduling is investigated. Iterated Greedy extended for optimizing Additive Manufacturing Scheduling Problems, AMSP. The developed algorithm outperforms the state-of-the-art in AMSP literature. Directions future development of AMSPs are suggested. As a disruptive technology, additive manufacturing (AM) revolutionizing supply chains. AM consists producing 3-dimensional objects through layer-by-layer addition compound material based on digital models. operations differs from traditional (i.e., subtractive and injection molding) with single run involving several parts/geometries; this makes jobs heterogeneous. Limited studies have investigated Problems (AMSP). This study extends to solve considering single-machine setting. For purpose, computational mechanisms customized account AM-specific characteristics scheduling. Numerical analysis shows that vast majority best-found solutions yielded by Adjusted (AIG) both solution quality stability; outperformance becomes more significant an increase problem size. Statistical confirms AIG’s performance notably better than existing terms stability. concluded providing directions extend industrial reach 3D printing technology.
منابع مشابه
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملTopology Optimization for Additive Manufacturing
This paper gives an overview of the issues and opportunities for the application of topology optimization methods for additive manufacturing (AM). The main analysis issues discussed are: how to achieve the maximum geometric resolution to allow the fine features easily manufacturable by AM to be represented in the optimization model; the manufacturing constraints to be considered, and the workfl...
متن کاملRestarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems
Multi-objective optimisation problems have seen a large impulse in the last decades. Many new techniques for solving distinct variants of multi-objective problems have been proposed. Production scheduling, as with other operations management elds, is no di erent. The owshop problem is among the most widely studied scheduling settings. Recently, the Iterated Greedy methodology for solving the si...
متن کاملIterated greedy local search methods for unrelated parallel machine scheduling
This work deals with the parallel machines scheduling problem which consists in the assignment of n jobs on m parallel machines. The most general variant of this problem is when the processing time depends on the machine to which each job is assigned to. This case is known as the unrelated parallel machines problem. Similarly to most of the literature, this paper deals with the minimization of ...
متن کاملSelf-supporting Topology Optimization for Additive Manufacturing
The paper presents a topology optimization approach that designs an optimal structure, called a self-supporting structure, which is ready to be fabricated via additive manufacturing without the usage of additional support structures. Such supports in general have to be created during the fabricating process so that the primary object can be manufactured layer by layer without collapse, which is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems With Applications
سال: 2022
ISSN: ['1873-6793', '0957-4174']
DOI: https://doi.org/10.1016/j.eswa.2022.116908